Similarity Measure Construction for Non-Convex Fuzzy Membership Function
نویسندگان
چکیده
منابع مشابه
Evaluation of Optimal Fuzzy Membership Function for Wind Speed Forecasting
In this paper, a new approach is proposed in order to select an optimal membership function for inputs of wind speed prediction system. Then using a fuzzy method and the stochastic characteristics of wind speed in the previous year, the wind speed modeling is performed and the wind speed for the future year will be predicted. In this proposed method, the average and the standard deviation of in...
متن کاملFuzzy Similarity Measure for Generalized Fuzzy Numbers
This paper proposes a new fuzzy similarity measure to calculate the degree of similarity of generalized fuzzy numbers (GFN’s).The fuzzy similarity measure is developed by integrating the concept of centre of gravity (COG) points and fuzzy difference of distance of points of fuzzy numbers. A fuzzy description for difference of distances between fuzzy numbers in its turn exploits appropriate simi...
متن کاملCosine Similarity Measure According to a Convex Cost Function
In this paper, we describe a new vector similarity measure associated with a convex cost function. Given two vectors, we determine the surface normals of the convex function at the vectors. The angle between the two surface normals is the similarity measure. Convex cost function can be the negative entropy function, total variation (TV) function and filtered variation function. The convex cost ...
متن کاملINTERVAL-VALUED INTUITIONISTIC FUZZY SETS AND SIMILARITY MEASURE
In this paper, the problem of measuring the degree of inclusion and similarity measure for two interval-valued intuitionistic fuzzy sets is considered. We propose inclusion and similarity measure by using order on interval-valued intuitionistic fuzzy sets connected with lexicographical order. Moreover, some properties of inclusion and similarity measure and some correlation, between them an...
متن کاملA NOVEL FUZZY-BASED SIMILARITY MEASURE FOR COLLABORATIVE FILTERING TO ALLEVIATE THE SPARSITY PROBLEM
Memory-based collaborative filtering is the most popular approach to build recommender systems. Despite its success in many applications, it still suffers from several major limitations, including data sparsity. Sparse data affect the quality of the user similarity measurement and consequently the quality of the recommender system. In this paper, we propose a novel user similarity measure based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2008
ISSN: 1976-9172
DOI: 10.5391/jkiis.2008.18.1.145